Algebraic Properties of Multilinear Constraints
نویسندگان
چکیده
In this paper the diierent algebraic varieties that can be generated from multiple view geometry with uncalibrated cameras have been investigated. The natural descriptor, Vn, to work with is the image of IP 3 in IP 2 I P 2 I P 2 under a corresponding product of projections, (A1 A2 : : :Am). Another descriptor, the variety V b , is the one generated by all bilinear forms between pairs of views, which consists of all points in IP 2 IP 2 IP 2 where all bilinear forms vanish. Yet another descriptor, the variety Vt , is the variety generated by all trilinear forms between triplets of views. It has been shown that when m = 3, V b is a reducible variety with one component corresponding to Vt and another corresponding to the trifocal plane. Furthermore, when m = 3, Vt is generated by the three bilinearities and one trilinearity, when m = 4, Vt is generated by the six bilinearities and when m 4, Vt can be generated by the (m 2) bilinearities. This shows that four images is the generic case in the algebraic setting, because Vt can be generated by just bilinearities. Furthermore, some of the bilinearities may be omitted when m 5.
منابع مشابه
Functional Equations, Constraints, Definability of Function Classes, and Functions of Boolean Variables
The paper deals with classes of functions of several variables defined on an arbitrary set A and taking values in a possibly different set B. Definability of function classes by functional equations is shown to be equivalent to definability by relational constraints, generalizing a fact established by Pippenger in the case A = B = {0, 1}. Conditions for a class of functions to be definable by c...
متن کاملSimulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity
We study structural properties of restricted width arithmetical circuits. It is shown that syntactically multilinear arithmetical circuits of constant width can be efficiently simulated by syntactically multilinear algebraic branching programs of constant width, i.e. that sm-VSC ⊆ sm-VBWBP. Also, we obtain a direct characteriztion of poly-size arithmetical formulas in terms of multiplicatively ...
متن کاملLower Bounds for Syntactically Multilinear Algebraic Branching Programs
It is shown that any weakly-skew circuit can be converted into a skew circuit with constant factor overhead, while preserving either syntactic or semantic multilinearity. This leads to considering syntactically multilinear algebraic branching programs (ABPs), which are defined by a natural read-once property. A 2 size lower bound is proven for ordered syntactically multilinear ABPs computing an...
متن کاملMultilinear Constraints in Two-dimensional Vision and Isogonal Conjugacy
Invariance has become increasingly important in computer vision. One type of invariance is viewpoint invariance, i.e. properties of viewed objects that are invariant under camera motion. Another important concept is object invariance, i.e. properties of the image that only depend on motion and not on the viewed objects. The epipolar constraint in three dimensional vision, is an example of the l...
متن کاملSeparation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three Circuits
We show an exponential separation between two well-studied models of algebraic computation, namely read-once oblivious algebraic branching programs (ROABPs) and multilinear depth three circuits. In particular we show the following: 1. There exists an explicit n-variate polynomial computable by linear sized multilinear depth three circuits (with only two product gates) such that every ROABP comp...
متن کامل